The m-step competition graph of a digraph
نویسندگان
چکیده
منابع مشابه
The m-step competition graph of a digraph
The competition graph of a digraph was introduced by Cohen in 1968 associated with the study of ecosystems. Since then, the competition graph has been widely studied and many variations have been introduced. In this paper, we de ne and study the m-step competition graph of a digraph which is another generalization of competition graph. ? 2000 Elsevier Science B.V. All rights reserved.
متن کاملThe competition-common enemy graph of a digraph
The competit ion graph of a digraph was first defined in 1968 by Cohen in the study of ecosystems. The competition graph essentially relates any two species which have a common prey. In this paper, a compet i t ion-common enemy graph of a digraph is defined and studied. As the term suggests, it relates any two species which have a common prey and a common enemy. Results analogous to those found...
متن کاملA note on the existence of edges in the (1, 2)-step competition graph of a round digraph
Factor and Merz [Discrete Appl. Math. 159 (2011), 100–103] defined the (1, 2)-step competition graph and studied the (1, 2)-step competition graph of a tournament. In this paper, a sufficient and necessary condition for any two vertices to be adjacent in the (1, 2)-step competition graph C1,2(D) of a round digraph D is given. 1 Terminology and Introduction The competition graph of a digraph, in...
متن کاملThe double competition multigraph of a digraph
The competition graph of a digraph is defined to be the intersection graph of the family of the out-neighborhoods of the vertices of the digraph (see [6] for intersection graphs). A digraph D is a pair (V (D), A(D)) of a set V (D) of vertices and a set A(D) of ordered pairs of vertices, called arcs. An arc of the form (v, v) is called a loop. For a vertex x in a digraph D, we denote the out-nei...
متن کاملThe (1, 2)-step competition graph of a tournament
The competition graph of a digraph, introduced by Cohen in 1968, has been extensively studied. More recently, in 2000, Cho, Kim and Nam defined the m-step competition graph. Here, we offer another generalization of the competition graph. We define the (1,2)-step competition graph of a digraph D, denoted C1,2(D) , as the graph of V(D) where {x,y} is an element of E(C1,2(D)) if and only if there ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00214-6